An Automata Characterisation for Multiple Context-Free Languages
نویسنده
چکیده
We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.
منابع مشابه
A Grammatical Characterisation of Visibly Pushdown Languages
Model-checking regular properties has been proven to be a useful verification technique for regular as well as context-free programs. Only recently, model-checking was extended by ω-visibly pushdown languages (ωVPLs) beyond verifying regular properties and shown to be still decidable when the program is an ωVPL too. In this paper, we give a grammatical characterisation of ωVPLs and the correspo...
متن کاملMonoid Automata for Displacement Context-Free Languages
In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...
متن کاملA Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
We give a characterisation of languages on infinite alphabets in a variant of nominal regular expressions with permutations (p-NREs). We also introduce automata with fresh name generations and permutations (fp-automata), inspired by history-dependent automata (HDAs) and fresh-register automata. Noteworthy, permutations require to deal with dynamic context-dependent expressions. Finally, we give...
متن کاملPartially-commutative context-free graphs
This thesis is about an extension of context-free grammars with partial commutation on nonterminal symbols. In particular, we investigate the subclass with transitive dependence relation and the corresponding automaton model: stateless multi-pushdown automata. The results of the thesis are divided into three chapters. The first chapter investigates language expressivity of concerned classes. Ro...
متن کاملA Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...
متن کامل